Topological voiceprints for speaker identification
نویسندگان
چکیده
منابع مشابه
Topological representation of speech for speaker recognition
During last decade, researchers in speaker recognition have been working over the same acoustic space, regardless of whether the data lie on a linear space or not. Our proposal is to take into account the inner geometric structure of the speech in order to obtain a new space with a better representation of the speech data. A topological approach based on manifolds obtained thanks to Laplacian a...
متن کاملCluster Identification for Speaker
Cluster Identification is introduced as the process of jointly evaluating clustering and labelling schemes for cluster-labelling scheme selection. Normalized Rand and BBN metrics for comparing clustering performances across varied clustering and labelling schemes are presented. The merits of the metrics are evaluated and applied for speaker-environment tracking in Broadcast News.
متن کاملA new nonlinear speaker parameterization algorithm for speaker identification
In this paper we propose a new coding algorithm based on nonlinear prediction: the Neural Predictive Coding model which is an extension of the classical LPC one. The features performances are estimated by two different methods: the ArithmeticHarmonic Sphericity (AHS) and the Auto-Regressive Vectorial Models (ARVM). Two different methods are proposed for the coding method based on the Neural Pre...
متن کاملSpeaker Discriminative Weighting Method for VQ-Based Speaker Identification
We consider the matching function in vector quantization based speaker identification system. The model of a speaker is a codebook generated from the set of feature vectors from the speakers voice sample. The matching is performed by evaluating the similarity of the unknown speaker and the models in the database. In this paper, we propose to use weighted matching method that takes into account ...
متن کاملA Speaker Pruning Algorithm for Real-Time Speaker Identification
Speaker identification is a computationally expensive task. In this work, we propose an iterative speaker pruning algorithm for speeding up the identification in the context of real-time systems. The proposed algorithm reduces computational load by dropping out unlikely speakers as more data arrives into the processing buffer. The process is repeated until there is just one speaker left in the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physica D: Nonlinear Phenomena
سال: 2005
ISSN: 0167-2789
DOI: 10.1016/j.physd.2004.09.008